546C - Soldier and Cards - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
// queue<int>st1,st2;
queue<int> insertToBottom(queue<int>s,int data){
	queue<int>temp;
	while(!s.empty()){
		temp.push(s.front());
		s.pop();
	}
	s.push(data);
	while(!temp.empty()){
		s.push(temp.front());
		temp.pop();
	}
	return s;
}
int32_t main(){
	int n;	cin >> n;
	int k1;	cin >> k1;
	queue<int>st1;
	for(int i=0;i<k1;i++){
		int x;	cin >> x;
		st1.push(x);
	}
	int k2;	cin >> k2;
	queue<int>st2;
	for(int i=0;i<k2;i++){
		int x;	cin >> x;
		st2.push(x);
	}
	int cunt = 0;
	while(1){
		if(st1.size()==0 || st2.size()==0) break;
	 	int x = st1.front();
	 	st1.pop();
	 	int y = st2.front();
	 	st2.pop();
	 	if(x>y){
	 		// st1 = insertToBottom(st1,x);
	 		// st1 = insertToBottom(st1,y);
			st1.push(y);
			st1.push(x);
	 		cunt++;
	 	}
	 	else if(x<y){
	 		// st2 = insertToBottom(st2,y);
	 		// st2 = insertToBottom(st2,x);
			st2.push(x);
			st2.push(y);
	 		cunt++;
	 	}
		if(cunt>=n*n*n){
			cunt = -1;
			break;
		}
	 }
	//  cout << st1.size() << " " << st2.size() << endl;
	//  while(!st2.empty()){
	//  	cout << st2.front() << " ";
	//  	st2.pop();
	//  }
	 if(cunt!=0) cout << cunt << " ";
	//  else cout << -1 << " ";
	 if(st1.size()!=0 && cunt!=-1) cout << 1 << endl;
	 else if(cunt!=-1) cout << 2 << endl;
}